117 research outputs found

    First Order Error Correction for Trimmed Quadrature in Isogeometric Analysis

    Get PDF
    International audienceIn this work, we develop a specialized quadrature rule for trimmed domains , where the trimming curve is given implicitly by a real-valued function on the whole domain. We follow an error correction approach: In a first step, we obtain an adaptive subdivision of the domain in such a way that each cell falls in a pre-defined base case. We then extend the classical approach of linear approximation of the trimming curve by adding an error correction term based on a Taylor expansion of the blending between the linearized implicit trimming curve and the original one. This approach leads to an accurate method which improves the convergence of the quadrature error by one order compared to piecewise linear approximation of the trimming curve. It is at the same time efficient, since essentially the computation of one extra one-dimensional integral on each trimmed cell is required. Finally, the method is easy to implement, since it only involves one additional line integral and refrains from any point inversion or optimization operations. The convergence is analyzed theoretically and numerical experiments confirm that the accuracy is improved without compromising the computational complexity

    Hermite interpolation by Pythagorean hodograph curves of degree seven

    No full text
    Polynomial Pythagorean hodograph (PH) curves form a remarkable subclass of polynomial parametric curves; they are distinguished by having a polynomial arc length function and rational offsets (parallel curves). Many related references can be found in the article by Farouki and Neff on C 1 Hermite interpolation with PH quintics. We extend the C 1 Hermite interpolation scheme by taking additional curvature information at the segment boundaries into account. As a result we obtain a new construction of curvature continuous polynomial PH spline curves. We discuss Hermite interpolation of G 2 [C 1] boundary data (points, first derivatives, and curvatures) with PH curves of degree 7. It is shown that up to eight possible solutions can be found by computing the roots of two quartic polynomials. With the help of the canonical Taylor expansion of planar curves, we analyze the existence and shape of the solutions. More precisely, for Hermite data which are taken from an analytical curve, we study the behaviour of the solutions for decreasing stepsize ∆. It is shown that a regular solution is guaranteed to exist for sufficiently small stepsize ∆, provided that certain technical assumptions are satisfied. Moreover, this solution matches the shape of the original curve; the approximation order is 6. As a consequence, any given curve, which is assumed to be G 2 (curvature continuous) and to consist of analytical segments can approximately be converted into polynomial PH form. The latter assumption is automatically satisfied by the standard curve representations of Computer Aided Geometric Design, such as Bézier or B-spline curves. The conversion procedure acts locally, without any need for solving a global system of equations. It produces G 2 polynomial PH spline curves of degree 7

    Industrial Geometry INDUSTRIAL GEOMETRY Computer Vision Modeling and 3D Object Reconstruction by Implicitly Defined Surfaces with Sharp Features Modeling and 3D Object Reconstruction by Implicitly Defined Surfaces with Sharp Features

    No full text
    Abstract We propose a new method for describing sharp features (i.e., edges and vertices) of implicitly defined surfaces. We consider an initial implicitly defined surface, which is represented as the zero set of a C 1 smooth scalar field with non-vanishing gradients. In order to represent sharp edges and vertices, this surface is augmented by adding a new type of implicit representations, which are called edge descriptors and vertex descriptors. They are defined with the help of the distance field of edge curves. In our implementation, we use circular splines to describe these edge curves, since they support a fast and non-iterative closest point computation. After adding the edge and vertex descriptors to the initial scalar field, the zero set of the augmented function contains the sharp features. We apply the new representation to surface modelling by implicitly defined surfaces with sharp features and to object reconstruction. In the latter case we describe an algorithm for detecting the sharp curves and vertices of a shape which is given by an unorganized point cloud, which are then approximated by circular splines, in order to define the edge and vertex descriptors
    corecore